1342 - 2812 A new lattice construction for partial key exposure attack for RSA ( revised ) Yoshinori Aono
نویسنده
چکیده
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7]. This is a full version of the paper that appears in the proceedings of PKC 2009.
منابع مشابه
A New Lattice Construction for Partial Key Exposure Attack for RSA
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7].
متن کاملNew lattice construction for partial key exposure attack for RSA
In this paper we present a new lattice construction for a lattice based partial key exposureattack for the RSA cryptography. We consider the situation that the RSA secret key d is smalland a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. Weshow that our lattice construction is theoretically more efficient than known attacks proposedin ...
متن کاملSimplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
In this paper we present a new formulation and its simpler analysis of the lattice based attack of Boneh and Durfee for the RSA cryptography [2]. We follow the same approach of Boneh and Durfee, however we propose a new way of defining a lattice with which we can achieve the same solvable key bound d < N. Our lattice is represented as a lower triangle matrix, which makes its analysis much simpl...
متن کاملMinkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith's Technique and Applications to RSA
We investigate a lattice construction method for the Coppersmith technique for finding small solutions of a modular equation. We consider its variant for simultaneous equations and propose a method to construct a lattice by combining lattices for solving single equations. As applications, we consider a new RSA cryptanalyses. Our algorithm can factor an RSA modulus from l ≥ 2 pairs of RSA public...
متن کاملMinkowski sum based lattice construction for solving simultaneous modular equations and applications to RSA
We investigate a lattice construction method for the Coppersmith technique for finding small solu-tions of a modular equation. We consider its variant for simultaneous equations and propose a methodto construct a lattice by combining lattices for solving single equations. As applications, we consider(i) a new RSA cryptanalysis for multiple short secret exponents, (ii) its partial ke...
متن کامل